Theorem Proving Techniques and P-functions for Logic Design and Logic Programming
نویسندگان
چکیده
It is shown that theorem proving methods can lead to program synthesis and algorithm implementation by using pairs of logic laws: a deductive law for proving the theorem and a constructive law for synthesizing the program or algorithm. The construction of program schemata in an algorithmic programming environment and logic programming in a declarative programming environment appear as two particular and extreme cases of the model of pairs of laws acting on pairs of logic expressions. A systematic examination of deductive laws and of constructive laws is presented. The set of all possible pairs of laws provides us with a tool for classifying the different approaches for materializing algorithms (e.g. hardware, microprogrammed, algorithmic programming, declarative programming, deo ductive approach for recursive routines). Computing Reviews Classification: I.1.2.3./B.1.2.
منابع مشابه
A Fast and Self-Repairing Genetic Programming Designer for Logic Circuits
Usually, important parameters in the design and implementation of combinational logic circuits are the number of gates, transistors, and the levels used in the design of the circuit. In this regard, various evolutionary paradigms with different competency have recently been introduced. However, while being advantageous, evolutionary paradigms also have some limitations including: a) lack of con...
متن کاملThe Applicability of Logic Program Analysis and Transformation to Theorem Proving
Analysis and transformation techniques developed for logic programming can be successfully applied to automatic theorem proving. In this paper we demonstrate how these techniques can be used to infer useful information that can speed up theorem provers, assist in the identiication of necessary inference rules for solving speciic problems, how failure branches can be eliminated from the proof tr...
متن کاملTheory Exploration with Theorema
Automated theorem proving is a well established subject in computer science. The advances made in the algorithmic techniques for automated theorem proving are impressive, see the survey paper [Loveland 1996]. Also, automated theorem proving has found various important applications in computer science. For example, Robinson’s resolution proving method launched a whole new programming paradigm, n...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملThe Applicability of Logic Program Analysis and Transformation to Theorem Proving 1
Analysis and transformation techniques developed for logic programming can be successfully applied to automatic theorem proving. In this paper we demonstrate how these techniques can be used to infer useful information that can speed up theorem provers, assist in the identiication of necessary inference rules for solving speciic problems, how failure branches can be eliminated from the proof tr...
متن کامل